Ordered groups: a case study in reverse mathematics

نویسنده

  • Reed Solomon
چکیده

The fundamental question in reverse mathematics is to determine which set existence axioms are required to prove particular theorems of mathematics. In addition to being interesting in their own right, answers to this question have consequences in both effective mathematics and the foundations of mathematics. Before discussing these consequences, we need to be more specific about the motivating question. Reverse mathematics is useful for studying theorems of either countable or essentially countable mathematics. Essentially countable mathematics is a vague term that is best explained by an example. Complete separable metric spaces are essentially countable because, although the spaces may be uncountable, they can be understood in terms of a countable basis. Simpson (1985) gives the following list of areas which can be analyzed by reverse mathematics: number theory, geometry, calculus, differential equations, real and complex analysis, combinatorics, countable algebra, separable Banach spaces, computability theory, and the topology of complete separable metric spaces. Reverse mathematics is less suited to theorems of abstract functional analysis, abstract set theory, universal algebra, or general topology. Section 2 introduces the major subsystems of second order arithmetic used in reverse mathematics: RCA0, WKL0, ACA0, ATR0 and Π1−CA0. Sections 3 through 7 consider various theorems of ordered group theory from the perspective of reverse mathematics. Among the results considered are theorems on ordered quotient groups (including an equivalent of ACA0), groups and semigroup conditions which imply orderability (WKL0), the orderability of free groups (RCA0), Hölder’s Theorem (RCA0), Mal’tsev’s classification of the order types of countable ordered groups (Π1 − CA0) and the existence of strong divisible closures (ACA0). Section 8 deals more directly with computability ∗This material comes from the author’s PhD thesis under the direction of Richard Shore, Cornell University

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convex $L$-lattice subgroups in $L$-ordered groups

In this paper, we have focused to study convex $L$-subgroups of an $L$-ordered group. First, we introduce the concept of a convex $L$-subgroup and a convex $L$-lattice subgroup of an $L$-ordered group and give some examples. Then we find some properties and use them to construct convex $L$-subgroup generated by a subset $S$ of an $L$-ordered group $G$ . Also, we generalize a well known result a...

متن کامل

Reverse Mathematics, Archimedean Classes, and Hahn’s Theorem

Archimedean classes and convex subgroups play important roles in the study of ordered groups. In this paper, we show that ACA0 is equivalent to the existence of a set of representatives for the Archimedean classes of an ordered abelian group. Hahn’s Theorem is the strongest known tool for classifying orders on abelian groups. It states that every ordered abelian group can be embedded into produ...

متن کامل

Ordering Free Products in Reverse Mathematics

This paper is a contribution to Harvey Friedman’s project of reverse mathematics in which one tries to classify theorems of ordinary mathematics by the set theoretic axioms required to prove them. All of the result in this paper are formalized in RCA0, the weakest of the standard systems in reverse mathematics, and concern classical theorems about countable ordered groups. The reader who is not...

متن کامل

A classification of hull operators in archimedean lattice-ordered groups with unit

The category, or class of algebras, in the title is denoted by $bf W$. A hull operator (ho) in $bf W$ is a reflection in the category consisting of $bf W$ objects with only essential embeddings as morphisms. The proper class of all of these is $bf hoW$. The bounded monocoreflection in $bf W$ is denoted $B$. We classify the ho's by their interaction with $B$ as follows. A ``word'' is a function ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Bulletin of Symbolic Logic

دوره 5  شماره 

صفحات  -

تاریخ انتشار 1999